Characterizing Obstacle-Avoiding Paths Using Cohomology Theory

نویسندگان

  • Pawel Dlotko
  • Walter G. Kropatsch
  • Hubert Wagner
چکیده

In this paper, we investigate the problem of analyzing the shape of obstacle-avoiding paths in a space. Given a d-dimensional space with holes, representing obstacles, we ask if certain paths are equivalent, informally if one path can be continuously deformed into another, within this space. Algebraic topology is used to distinguish between topologically different paths. A compact yet complete signature of a path is constructed, based on cohomology theory. Possible applications include assisted living, residential, security and environmental monitoring. Numerical results will be presented in the final version of this paper.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A smooth, obstacle-avoiding curve

An algorithm for finding a smooth, obstacle-avoiding curve in the plane can be quite complicated. The process usually involves finding one or more feasible polyline paths, choosing a desirable path (for example the shortest path), and smoothing the polyline path to give a curve that avoids the obstacles. This paper is concerned with the last stage in the process; it assumes the existence of an ...

متن کامل

Planning Non-Entangling Paths for Tethered Underwater Robots Using Simulated Annealing

In this paper we present a simulated annealingbased method for planning efficient paths with a tether which avoid entanglement in an obstacle-filled environment. By evaluating total path cost as a function of both path length and entanglements, a robot can plan a path through multiple points of interest while avoiding becoming entangled in any obstacle. In simulated trials, the robot was able t...

متن کامل

Nonholonomic Path Planning Using Harmonic Functions

A method is presented for planning obstacle-avoiding paths for a system which exhibits nonholonomic constraints. The method is based on the use of harmonic functions. Linear constraints on the velocity of a nonholonomic system can be directly expressed as Neumann boundary conditions for a harmonic function. Such boundary conditions are easily represented in a resistive network. The resulting po...

متن کامل

Designing Path for Robot Arm Extensions Series with the Aim of Avoiding Obstruction with Recurring Neural Network

In this paper, recurrent neural network is used for path planning in the joint space of the robot with obstacle in the workspace of the robot. To design the neural network, first a performance index has been defined as sum of square of error tracking of final executor. Then, obstacle avoidance scheme is presented based on its space coordinate and its minimum distance between the obstacle and ea...

متن کامل

A New Global Fuzzy Path Planning and Obstacle Avoidance Scheme for Mobile Robots

In this paper, a new global path planning and obstacle avoidance scheme for mobile robot is proposed. The key to avoiding the obstacle is to fuzzify them and construct a fuzzy graph from the environment. Then, based on human performance a set of fuzzy rules is defined for robot navigation using these fuzzy sets and sub-optimal paths to the goal are generated. A fuzzy rule is defined for avoidin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011